Map segmentation for geospatial data mining through generalized higher-order Voronoi diagrams with sequential scan algorithms

نویسندگان

  • Ickjai Lee
  • Christopher Torpelund-Bruin
  • Kyungmi Lee
چکیده

Segmentation is one popular method for geospatial data mining. We propose efficient and effective sequential-scan algorithms for higher-order Voronoi diagram districting. We extend the distance transform algorithm to include complex primitives (point, line, and area), Minkowski metrics, different weights and obstacles for higher-order Voronoi diagrams. The algorithm implementation is explained along with efficiencies and error. Finally, a case study based on trade area modeling is described to demonstrate the advantages of our proposed algorithms. Crown Copyright 2012 Published by Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voronoi Image Segmentation and Its Applications to Geoinformatics

As various geospatial images are available for analysis, there is a strong need for an intelligent geospatial image processing method. Segmenting and districting digital images is a core process and is of great importance in many geo-related applications. We propose a flexible image segmentation framework based on generalized Voronoi diagrams through Euclidean distance transforms. We introduce ...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

K-Voronoi diagrams computing in arbitrary domains

We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the domain size, and has higher accuracy than other geodesic distance transformations published before. Our appr...

متن کامل

Point Cluster Analysis Using a 3D Voronoi Diagram with Applications in Point Cloud Segmentation

Three-dimensional (3D) point analysis and visualization is one of the most effective methods of point cluster detection and segmentation in geospatial datasets. However, serious scattering and clotting characteristics interfere with the visual detection of 3D point clusters. To overcome this problem, this study proposes the use of 3D Voronoi diagrams to analyze and visualize 3D points instead o...

متن کامل

Geospatial Cluster Tessellation Through the Complete Order- k Voronoi Diagrams

In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster gro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2012